Stabilizing Intelligent Route Control: Randomized Path Monitoring, Randomized Path Switching or History-Aware Path Switching?
نویسندگان
چکیده
Multihoming Intelligent Route Control (IRC) plays a significant role in improving the performance of Internet accesses. However, in a competitive environment, IRC systems may introduce persistent route oscillations, causing significant performance degradation. In this study, we investigate three design alternatives to cope with this issue: Randomized Path Monitoring, Randomized Path Switching and Historyaware Path Switching. The simulation results show that Randomized Path Monitoring is an effective alternative to Randomized Path switching when the sampling frequency is conservative. The results also indicate that the use of a sophisticated IRC algorithm, such as history-aware path switching, may not bring any benefit in terms of stability.
منابع مشابه
Near-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملUniversal O ( congestion + dilation + log 1 + N ) Local Control Packet Switching Algorithms
In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network, given any collection of packets with a speci ed route for each packet, there exists an \optimal" schedule for all these packets. That is, there exists a schedule of the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destin...
متن کاملRFC 5521 Extensions to
The Path Computation Element (PCE) provides functions of path computation in support of traffic engineering (TE) in Multi-Protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. When a Path Computation Client (PCC) requests a PCE for a route, it may be useful for the PCC to specify, as constraints to the path computation, abstract nodes, resources, and Shared Risk Link Groups (SR...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملSelective randomized load balancing and mesh networks with changing demands
We consider the problem of building cost-effective networks which are robust to dynamic changes in demand patterns. We compare several architectures based on using demandoblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuitswitched core infrastructure, and multi-hop (packet-switched) architectures based on point-to-point cir...
متن کامل